Historical Development of the BFGS Secant Method and Its Characterization Properties by Joanna Maria Papakonstantinou
نویسندگان
چکیده
Historical Development of the BFGS Secant Method and Its Characterization Properties by Joanna Maria Papakonstantinou The BFGS secant method is the preferred secant method for finite-dimensional unconstrained optimization. The first part of this research consists of recounting the historical development of secant methods in general and the BFGS secant method in particular. Many people believe that the secant method arose from Newton’s method using finite difference approximations to the derivative. We compile historical evidence revealing that a special case of the secant method predated Newton’s method by more than 3000 years. We trace the evolution of secant methods from 18th-century B.C. Babylonian clay tablets and the Egyptian Rhind Papyrus. Modifications to Newton’s method yielding secant methods are discussed and methods we believe influenced and led to the construction of the BFGS secant method are explored. In the second part of our research, we examine the construction of several rank-two secant update classes that had not received much recognition in the literature. Our study of the underlying mathematical principles and characterizations inherent in the updates classes led to theorems and their proofs concerning secant updates. One class of symmetric rank-two updates that we investigate is the Dennis class. We demonstrate how it can be derived from the general rank-one update formula in a purely algebraic manner not utilizing Powell’s method of iterated projections as Dennis did it. The literature abounds with update classes; we show how some are related and show containment when possible. We derive the general formula that could be used to represent all symmetric rank-two secant updates. From this, particular parameter choices yielding well-known updates and update classes are presented. We include two derivations of the Davidon class and prove that it is a maximal class. We detail known characterization properties of the BFGS secant method and describe new characterizations of several secant update classes known to contain the BFGS update. Included is a formal proof of the conjecture made by Schnabel in his 1977 Ph.D. thesis that the BFGS update is in some asymptotic sense the average of the DFP update and the Greenstadt update.
منابع مشابه
The modified BFGS method with new secant relation for unconstrained optimization problems
Using Taylor's series we propose a modified secant relation to get a more accurate approximation of the second curvature of the objective function. Then, based on this modified secant relation we present a new BFGS method for solving unconstrained optimization problems. The proposed method make use of both gradient and function values while the usual secant relation uses only gradient values. U...
متن کاملOrigin and Evolution of the Secant Method in One Dimension
Many in the mathematical community believe that the secant method arose from Newton’s method using a finite difference approximation to the derivative, most likely because that is the way that it is taught in contemporary texts. However, we were able to trace the origin of the secant method all the way back to the Rule of Double False Position described in the 18th-century B.C. Egyptian Rhind P...
متن کاملOn averaging and representation properties of the BFGS and related secant updates
In this talk we present several representation theorems and averaging theorems for members of the difference class of secant updates introduced by Broadlie, Gourlay , and Greenstadt in 1973. The BFGS update is a well-known member of this difference class. We begin with the notion of an update kernel and use it to construct a new parametrization of the difference class of secant updates. Next we...
متن کاملApproximate invariant subspaces and quasi-newton optimization methods
New approximate secant equations are shown to result from the knowledge of (problem dependent) invariant subspace information, which in turn suggests improvements in quasi-Newton methods for unconstrained minimization. A new limitedmemory BFGS using approximate secant equations is then derived and its encouraging behaviour illustrated on a small collection of multilevel optimization examples. T...
متن کاملLow complexity secant quasi-Newton minimization algorithms for nonconvex functions
In this work some interesting relations between results on basic optimization and algorithms for nonconvex functions (such as BFGS and secant methods) are pointed out. In particular, some innovative tools for improving our recent secant BFGS-type and LQN algorithms are described in detail. © 2006 Elsevier B.V. All rights reserved. MSC: 51M04; 65H20; 65F30; 90C53
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010